Traveling salesman problem and local search
نویسندگان
چکیده
منابع مشابه
Estimation-based Local Search for the Probabilistic Traveling Salesman Problem
In this paper, we propose an effective local search algorithm that makes use of empirical estimation techniques for a class of stochastic combinatorial optimization problems. We illustrate our approach and assess its performance on the probabilistic traveling salesman problem. Experimental results on a large set of instances show that our approach is very competitive.
متن کاملDynamics of Local Search Trajectory in Traveling Salesman Problem
This paper investigates dynamics of a local search trajectory generated by running the Or-opt heuristic on the traveling salesman problem. This study evaluates the dynamics of the local search heuristic by estimating the correlation dimension for the search trajectory, and finds that the local heuristic search process exhibits the transition from high-dimensional stochastic to low-dimensional c...
متن کاملExperiments with Local Search Heuristics for the Traveling Salesman Problem
Abstract. In this paper, the experiments with local search heuristic algorithms for the traveling salesman problem (TSP) are described. Since the ordinary local search heuristics very seldom yield solutions of high quality, we investigate the enhanced local search algorithms using the extended neighbourhood structures. We also examine the performance of the local search heuristics in an iterate...
متن کاملExponential neighbourhood local search for the traveling salesman problem
Scope and Purpose { While exact algorithms can only be used for solving small or quite moderate instances of the traveling salesman problem (TSP), local search remains the main practical tool for nding near optimal solutions for large scale instances. Exponential neighbourhood local search (ENLS) is a relatively new direction in local search for the TSP. In ENLS, one nds the best among very lar...
متن کاملDynamics of local search heuristics for the traveling salesman problem
This paper experimentally investigates the dynamical behavior of a search process in a local heuristic search system for a combinatorial optimization problem. Or-opt heuristic algorithm is chosen as the study subject, and the well-known traveling salesman problem (TSP) serves as a problem testbed. This study constructs the search trajectory by using the time-delay method, evaluates the dynamics...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applied Mathematics Letters
سال: 1992
ISSN: 0893-9659
DOI: 10.1016/0893-9659(92)90090-v